<HTML><HEAD><TITLE>graph_is_acyclic(+Graph)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>graph_is_acyclic(+Graph)</H1>
Succeeds iff the given graph has no cycles
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
</DL>
<H3>Modes and Determinism</H3><UL>
<LI>graph_is_acyclic(+) is semidet
</UL>
<H3>Fail Conditions</H3>
No topological ordering exists, i.e. the graph is cyclic
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/top_sort-2.html">top_sort / 2</A>, <A HREF="../../lib/graph_algorithms/graph_cycles-2.html">graph_cycles / 2</A>
</BODY></HTML>
